Enter a word or phrase in any language 👆
Language:
Translation and analysis of words by ChatGPT artificial intelligence
On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
- how the word is used
- frequency of use
- it is used more often in oral or written speech
- word translation options
- usage examples (several phrases with translation)
- etymology
What (who) is recursion - definition
PROCESS OF REPEATING ITEMS IN A SELF-SIMILAR WAY
Recursion definition; Recursive; Recursivity; Recursionism; Recursively; Infinite Recursion; Recursion, infinite; Recursor function; Recursionisms; Recursion (Concept); Recursion (concept); Recursive routine; Recursions; Recursion principle; Recursive structure; Infinite loop motif; Infinite-loop motif; Recursiveness; Mathematical recursion; Base case (recursion); Recursoin; Recursive step; Recurson; Recursive humour; Recursion in natural languages; Recursion (linguistics)
![Malyutin]], 1892](https://commons.wikimedia.org/wiki/Special:FilePath/First matryoshka museum doll open.jpg?width=200 "Malyutin]], 1892")
![Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).](https://commons.wikimedia.org/wiki/Special:FilePath/Polittico stefaneschi, verso.jpg?width=200 "Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).")
![[[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail.](https://commons.wikimedia.org/wiki/Special:FilePath/Serpiente alquimica.jpg?width=200 "[[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail.")
![The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal](https://commons.wikimedia.org/wiki/Special:FilePath/Sierpinski triangle.svg?width=200 "The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal")
![Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.](https://commons.wikimedia.org/wiki/Special:FilePath/Sourdough.jpg?width=200 "Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.")
recursion
[r?'k?:?(?)n]
¦ noun chiefly Mathematics & Linguistics the repeated application of a procedure or rule to successive results of the process.
?a recursive procedure or formula.
recursion
<mathematics, programming> When a function (or procedure)
calls itself. Such a function is called "recursive". If the
call is via one or more other functions then this group of
functions are called "mutually recursive".
If a function will always call itself, however it is called,
then it will never terminate. Usually however, it first
performs some test on its arguments to check for a "base case"
- a condition under which it can return a value without
calling itself.
The canonical example of a recursive function is
factorial:
factorial 0 = 1
factorial n = n * factorial (n-1)
Functional programming languages rely heavily on recursion,
using it where a procedural language would use iteration.
See also recursion, recursive definition, tail recursion.
[Jargon File ]
(1996-05-11)
Recursion
·noun The act of recurring; return.
Wikipedia
Recursion
Recursion occurs when the definition of a concept or process depends on a simpler version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references ("crock recursion") can occur.
A process that exhibits recursion is recursive.
